Study of ISM tracers in galaxies

We collected data for two samples of normal and interacting galaxies for a total of 2953 galaxies having fluxes in one or more of the following wavebands: FIR, 21 cm line, CO(1-0) lines and soft X-ray. The large set of data obtained allowed us to revisit some of the already known relations between the different tracers of the interstellar medium (ISM), such as the link between the FIR flux and the CO line emission, the relation between X-ray emission and the blue or FIR luminosity. The relation lacking from observations for early-type galaxies has been discussed and explained in detail in the frame of a suitable theoretical model, obtained by coupling chemo-dynamical N-body simulations with a dusty spectrophotometric code of population synthesis.Comment: 2 pages, o appear in the Proceedings of the Conf. "From Stars to Galaxies: Building the Pieces to Build Up the Universe", Vallenari et al. eds., ASP Conf. Serie

Galaxy evolution in groups. USGC U268 and USGC U376 in the Leo cloud

With the aim of investigating galaxy evolution in nearby galaxy groups, we analysed the spectral energy distribution of 24 galaxies, members of two groups in the Leo cloud, USGC U268 and USGC U376. We estimated the ages and stellar masses of the galaxies by fitting their total apparent magnitudes from far-ultraviolet to near-infrared with population synthesis models. The comparison of the results for a subsample of galaxies with smooth particle hydrodynamic (SPH) simulations with chemo-photometric implementation, shows that in most cases the estimated stellar masses obtained with the two different approaches are in good agreement. The kinematical and dynamical analysis indicates that USGC U268 is in a pre-virial collapse phase while USGC U376 is likely in a more evolved phase towards virialization.Comment: 16 pages, 6 figures; accepted for publication in Advances in Space Research, Special Issue: Ultraviolet Astrophysic

A brief tour of formally secure compilation

Modern programming languages provide helpful high-level abstractions and mechanisms (e.g. types, module, automatic memory management) that enforce good programming practices and are crucial when writing correct and secure code. However, the security guarantees provided by such abstractions are not preserved when a compiler translates a source program into object code. Formally secure compilation is an emerging research field concerned with the design and the implementation of compilers that preserve source-level security properties at the object level. This paper presents a short guided tour of the relevant literature on secure compilation. Our goal is to help newcomers to grasp the basic concepts of this field and, for this reason, we rephrase and present the most relevant results in the literature in a common setting

Control-flow flattening preserves the constant-time policy

Obfuscating compilers protect a software by obscuring its meaning and impeding the reconstruction of its original source code. The typical concern when defining such compilers is their robustness against reverse engineering and the performance of the produced code. Little work has been done in studying whether the security properties of a program are preserved under obfuscation. In this paper we start addressing this problem: we consider control-flow flattening, a popular obfuscation technique used in industrial compilers, and a specific security policy, namely constant-time. We prove that this obfuscation preserves the policy, i.e., that every program satisfying the policy still does after the transformation

Editors\u27 Notes

Editors\u27 Notes: Volume 35, Issue

Revealing the trajectories of KLAIM tuples, statically

Klaim (Kernel Language for Agents Interaction and Mobility) has been devised to design distributed applications composed by many components deployed over the nodes of a distributed infrastructure and to offer programmers primitive constructs for communicating, distributing and retrieving data. Data could be sensitive and some nodes could not be secure. As a consequence it is important to track data in their traversal of the network. To this aim, we propose a Control Flow Analysis that over-approximates the behaviour of Klaim processes and tracks how tuple data can move in the network